Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
581	Chapter 3 Reconstructing DNA 3.1 Introduction Add to Reading List Source URL: www.liacs.nl Language: English - Date: 2009-07-03 16:04:35 NP-complete problems Search algorithms Operations research Travelling salesman problem Hamiltonian path Tree Routing algorithms Bellman–Ford algorithm Binary tree Theoretical computer science Mathematics Graph theory
582	5072 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 8, AUGUST 2011 Peer-to-Peer Streaming Capacity Sudipta Sengupta, Senior Member, IEEE, Shao Liu, Minghua Chen, Mung Chiang, Senior Member, IEEE, Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-01-19 22:20:59 NP-complete problems Constraint programming Steiner tree problem Maximum flow problem Tree T-tree B-tree Peer-to-peer Decomposition method Graph theory Mathematics Theoretical computer science
583	Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents Yoram Bachrach and Jeffrey S. Rosenschein {yori, jeff}@cs.huji.ac.il School of Engineering a Add to Reading List Source URL: www.ijcai.org Language: English - Date: 2005-07-11 16:49:14 Game theory Network flow Auctioneering Networks NP-complete problems Vertex cover Maximum flow problem Vickrey–Clarke–Groves auction Strategyproof Graph theory Mathematics Theoretical computer science
584	06 a SP Vukicevic[removed]qxp Add to Reading List Source URL: acta.chem-soc.si Language: English - Date: 2010-09-18 04:50:51 Pseudoforest Extremal graph theory Tree Graph operations NP-complete problems Graph theory Mathematics Graph
585	Smallest Tournaments Not Realizable by 23 -Majority Voting Dylan Shepardson Craig Tovey May[removed]Abstract Add to Reading List Source URL: www2.isye.gatech.edu Language: English - Date: 2011-04-21 15:28:35 NP-complete problems Tournament Hamiltonian path Graph Graph theory Theoretical computer science Mathematics
586	Expander Flows, Geometric Embeddings and Graph Partitioning SANJEEV ARORA Princeton University SATISH RAO and UMESH VAZIRANI Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2013-09-11 13:19:18 Combinatorial optimization NP-complete problems Cut Maximum flow problem Graph embedding Matching Vertex cover Big O notation Graph coloring Mathematics Theoretical computer science Graph theory
587	High Quality, Scalable and Parallel Community Detection for Large Real Graphs Arnau Prat-Pérez David Dominguez-Sal Add to Reading List Source URL: www.dama.upc.edu Language: English - Date: 2014-03-03 10:46:21 NP-complete problems Graph partition Graph Clique Matching Graph coloring Planar separator theorem Graph theory Mathematics Theoretical computer science
588	doi:[removed]j.tcs[removed] Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:39:01 Graph operations Clique Bron–Kerbosch algorithm Maximal independent set Independent set Line graph Clique-sum Graph theory Theoretical computer science NP-complete problems
589	Journal of Arti cial Intelligence Research[removed]318 Submitted 04/04 published[removed]Additive Pattern Database Heuristics Ariel Felner Add to Reading List Source URL: www.jair.org Language: English - Date: 2009-08-06 19:19:52 Heuristics NP-complete problems Heuristic function Admissible heuristic Search algorithms Fifteen puzzle A* search algorithm Shortest path problem Heuristic Mathematics Theoretical computer science Graph theory
590	MAP Estimation, Message Passing, and Perfect Graphs Tony Jebara Columbia University New York, NY[removed]removed] Add to Reading List Source URL: www.cs.columbia.edu Language: English - Date: 2010-02-20 14:17:31 Graphical models Probability theory Line graph Clique Chordal graph Graph coloring Tree decomposition Perfect graph Markov random field Graph theory Graph operations NP-complete problems

UPDATE